Identification of Pseudoknots in RNA Secondary Structures: A Grammatical Inference Approach
نویسنده
چکیده
Grammatical inference, an important field of syntactic pattern recognition, is finding wider acceptance in many practical applications like computation biology. In this work we show the use of grammatical inference techniques in identifying pseudoknots in the RNA secondary structures. Identification of RNA secondary structure is among the few structure identification problems that can be solved satisfactorily in polynomial time and data. We propose an Infer-Test model to identify the pseudoknots. This model uses the Terminal Distinguishable Even Linear Language inferencing technique to identify pseudoknots in the RNA secondary structures.
منابع مشابه
Grammatically Modeling and Predicting RNA Secondary Structures
Tree Adjunct Grammar for RNA (TAG 2 RNA ) is a new grammatical device to model RNA secondary structures including pseudoknots. An e cient parsing algorithm for this grammar is developed, and applied to some computational problems concerning RNA secondary structures. With this parser, we rst try to predict secondary structures of RNA sequences which are known to form pseudoknots structures, and ...
متن کاملP-dcfold or How to Predict all Kinds of Pseudoknots in Rna Secondary Structures
Pseudoknots play important roles in many RNAs. But for computational reasons, pseudoknots are usually excluded from the definition of RNA secondary structures. Indeed, prediction of pseudoknots increase very highly the complexities in time of the algorithms, knowing that all existing algorithms for RNA secondary structure prediction have complexities at least of O(n). Some algorithms have been ...
متن کاملThe language of RNA: a formal grammar that includes pseudoknots
MOTIVATION In a previous paper, we presented a polynomial time dynamic programming algorithm for predicting optimal RNA secondary structure including pseudoknots. However, a formal grammatical representation for RNA secondary structure with pseudoknots was still lacking. RESULTS Here we show a one-to-one correspondence between that algorithm and a formal transformational grammar. This grammar...
متن کاملPseudoViewer: automatic visualization of RNA pseudoknots
MOTIVATION Several algorithms have been developed for drawing RNA secondary structures, however none of these can be used to draw RNA pseudoknot structures. In the sense of graph theory, a drawing of RNA secondary structures is a tree, whereas a drawing of RNA pseudoknots is a graph with inner cycles within a pseudoknot as well as possible outer cycles formed between a pseudoknot and other stru...
متن کاملMMKnots: A max-margin model for RNA secondary structure prediction including pseudoknots
Motivation: The ideal algorithm for the prediction of pseudoknotted RNA secondary structures will provide fast and accurate predictions for pseudoknots of arbitrary complexity. However, existing algorithms are typically lacking on one of these three axes. Energy-based methods suffer from the intractability of pseudoknotted structure prediction under realistic energy models, while statistical ap...
متن کامل